Concurrent forward bounding for distributed constraint optimization problems
نویسندگان
چکیده
منابع مشابه
Concurrent forward bounding for distributed constraint optimization problems
Article history: Received 6 November 2011 Received in revised form 28 August 2012 Accepted 4 September 2012 Available online 7 September 2012
متن کاملAsynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchronously. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps one consistent partial assignment at all times. Forward bounding propagates the bounds on the cost o...
متن کاملOptimum Anytime Bounding for Constraint Optimization Problems
In this paper, we consider Constraint Optimization Problems in a Resource-Bounded context. We observe that both exact and approximate methods produce only an anytime upper bound of the optimum (in case of minimization). No lower bound, and thus no quality is available at run time. For a meta-reasoning system, it is difficult to reason on the basis of a so poor piece of information. Therefore, w...
متن کاملConcurrent Forward Bounding for DCOPs
A new search algorithm for solving distributed constraint optimization (DCOP) problems is presented. The proposed algorithm performs concurrent search on non intersecting parts of the global search space, using multiple search processes. Each Search Process uses synchronous forward bounding in its sub-space, to prune the remaining search space. Concurrent Forward Bounding (ConcFB) dynamically s...
متن کاملBounding the Optimum of Constraint Optimization Problems
Solving constraint optimization problems is computationally so expensive that it is often impossible to provide a guaranteed optimal solution, either when the problem is too large, or when time is bounded. In these cases, local search algorithms usually provide good solutions. However, and even if an optimality proof is unreachable, it is often desirable to have some guarantee on the quality of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2012
ISSN: 0004-3702
DOI: 10.1016/j.artint.2012.09.002